An $L^p$ theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
نویسندگان
چکیده
منابع مشابه
An L Theory of Sparse Graph Convergence I: Limits, Sparse Random Graph Models, and Power Law Distributions
We introduce and develop a theory of limits for sequences of sparse graphs based on Lp graphons, which generalizes both the existing L∞ theory of dense graph limits and its extension by Bollobás and Riordan to sparse graphs without dense spots. In doing so, we replace the no dense spots hypothesis with weaker assumptions, which allow us to analyze graphs with power law degree distributions. Thi...
متن کاملAsymptotics for Sparse Exponential Random Graph Models
We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain a variational principle for the limiting free energy, an associated concentration of measure, the asymptotics for the mean and variance of the limiting probability distribution, and phase transitions in the edge-triangle model. Similar analysis is...
متن کاملAn L Theory of Sparse Graph Convergence Ii: Ld Convergence, Quotients, and Right Convergence
We extend the Lp theory of sparse graph limits, which was introduced in a companion paper, by analyzing different notions of convergence. Under suitable restrictions on node weights, we prove the equivalence of metric convergence, quotient convergence, microcanonical ground state energy convergence, microcanonical free energy convergence, and large deviation convergence. Our theorems extend the...
متن کاملLearning sparse models of diffusive graph signals
Graph signals that describe data living on irregularly structured domains provide a generic representation for structured information in very diverse applications. The effective analysis and processing of such signals however necessitate good models that identify the most relevant signal components. In this paper, we propose to learn sparse representation models for graph signals that describe ...
متن کاملOn Sparse Gaussian Chain Graph Models
In this paper, we address the problem of learning the structure of Gaussian chain graph models in a high-dimensional space. Chain graph models are generalizations of undirected and directed graphical models that contain a mixed set of directed and undirected edges. While the problem of sparse structure learning has been studied extensively for Gaussian graphical models and more recently for con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2019
ISSN: 0002-9947,1088-6850
DOI: 10.1090/tran/7543